Better Lower Bounds for Monotone Threshold Formulas
نویسنده
چکیده
We show that every monotone formula that computes the threshold function THk,n, 2 ≤ k ≤ n2 , has size at least ⌊ k 2 ⌋ n log( n k−1 ). The same lower bound is shown to hold in the stronger monotone directed contact networks model.
منابع مشابه
Symmetric Approximation Arguments for Monotone Lower Bounds without Sun owers
We propose a symmetric version of Razborov's method of approximation to prove lower bounds for monotone circuit complexity. Traditionally, only DNF formulas have been used as approximators, whereas we use both CNF and DNF formulas. As a consequence we no longer need the Sun-ower lemma that has been essential for the method of approximation. The new approximation argument corresponds to Haken's ...
متن کاملFinite Limits and Monotone Computations: The Lower Bounds Criterion
Our main result is a combinatorial lower bounds criterion for monotone circuits over the reals. We allow any unbounded fanin non-decreasing real-valued functions as gates. The only requirement is their "local-ity". Unbounded fanin AND and OR gates, as well as any threshold gate T m s (x 1 ; : : : ; x m) with small enough threshold value minfs; m ? s + 1g, are simplest examples of local gates. T...
متن کاملSatisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases
We give a #SAT algorithm for boolean formulas over arbitrary finite bases. Let Bk be the basis composed of all boolean functions on at most k inputs. For Bk-formulas on n inputs of size cn, our algorithm runs in time 2n(1−δc,k) for δc,k = c −O(c2k2k). We also show the average-case hardness of computing affine extractors using linear-size Bk-formulas. We also give improved algorithms and lower b...
متن کاملLower Bounds for Exact Model Counting and Applications in Probabilistic Databases
The best current methods for exactly computing the number of satisfying assignments, or the satisfying probability, of Boolean formulas can be seen, either directly or indirectly, as building decision-DNNF (decision decomposable negation normal form) representations of the input Boolean formulas. Decision-DNNFs are a special case of dDNNFs where d stands for deterministic. We show that any deci...
متن کاملAmplification by Read-Once Formulas
Moore and Shannon have shown that relays with arbitrarily high reliability can be built from relays with arbitrarily poor reliability. Valiant used similar methods to construct monotone read-once formulas of size O(n) (where α = log√ 5−1 2 ≃ 3.27) that amplify (ψ− 1 n , ψ+ 1 n ) (where ψ = ( √ 5− 1)/2 ≃ 0.62) to (2−n, 1− 2−n) and deduced as a consequence the existence of monotone formulas of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 54 شماره
صفحات -
تاریخ انتشار 1997